A Parameterized Algorithm for Chordal Sandwich
نویسندگان
چکیده
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F , the Chordal Sandwich problem asks whether there exists a chordal graph (V, E ∪ F ′) such that F ′ ⊆ F . This problem arises from perfect phylogeny in evolution and from sparse matrix computations in numerical analysis, and it generalizes the widely studied problems of completions and deletions of arbitrary graphs into chordal graphs. As many related problems, Chordal Sandwich is NP-complete. In this paper we show that the problem becomes tractable when parameterized with a suitable natural measure on the set of admissible edges F . In particular, we give an algorithm with running time O(2kn5) to solve this problem, where k is the size of a minimum vertex cover of the graph (V, F ). Hence we show that the problem is fixed parameter tractable when parameterized by k. Note that the parameter does not assume any restriction on the input graph, and it concerns only the additional edge set F .
منابع مشابه
Subexponential parameterized algorithm for minimum fill-in
The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in time O(2O(k) + knm) on graphs with n vertices and m edges and thus is fixed parameter tractable. Here, we give the first subexponential parameterized algorithm solving Minimum Fillin in time O(2O( √ k log k) + knm). ...
متن کاملStrongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V,E1) and G2 = (V,E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \E1 such that G = (V,E1 ∪ {e1, . . . , ei}) belongs to the class for every i between 1 and k. In this paper we show that strongly chordal graphs and chordal bipartite graphs are sandwich monotone, answering an open question by Bakon...
متن کاملar X iv : 1 10 4 . 22 30 v 1 [ cs . D S ] 1 2 A pr 2 01 1 Subexponential Parameterized Algorithm for Minimum Fill - in ∗ Fedor
The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in timeO(2O(k)+k2nm) on graphs with n vertices and m edges and thus is fixed parameter tractable. Here, we give the first subexponential parameterized algorithm solving Minimum Fill-in in time O(2O( √ k log +knm). This ...
متن کاملTractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
We study the parameterized complexity of three NP hard graph completion problems The MINIMUM FILL IN problem is to decide if a graph can be triangulated by adding at most k edges We develop an O k mn f k algorithm for this problem on a graph with n vertices and m edges In particular this implies that the problem is xed parameter tractable FPT The PROPER INTERVAL GRAPH COMPLETION problem motivat...
متن کاملRecognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
A graph G = (V,E) is a chordal probe graph if its vertices can be partitioned into two sets, P (probes) and N (non-probes), where N is a stable set and such that G can be extended to a chordal graph by adding edges between non-probes. We give several characterizations of chordal probe graphs, first, in the case of a fixed given partition of the vertices into probes and non-probes, and second, i...
متن کامل